import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class Test1_1 {
    public static void main(String[] args) {
     Scanner input = new Scanner(System.in);
        System.out.println("请输入测试例个数：");
     int a = input.nextInt();
     for (int i = 0;i < a; i++){
         System.out.println("请输入整数序列的长度：");
         int n = input.nextInt();
         int[] numList = new int[n];
         System.out.println("请输入整数序列，中间用空格隔开：");
         for(int j = 0;j < n; j++){
             numList[j] = input.nextInt();
         }
         boolean c = false;
         Set<Integer> set = new HashSet<>();
         for (int num : numList){
             if(set.contains(num)){
                 c = true;
                 break;
             }else {
                 set.add(num);
             }
         }
         if (c){
             System.out.println("Yes");
         }else {
             System.out.println("No");
         }
     }
}}
    //总体时间复杂度为 O(m*n + n)。